Finite automata on timed ω-trees

A Model of Finite Automata on Timed ! -

Extended Timed Alternating Finite Automata: Revisited

In this paper, we continue to investigate timed alternating finite automata (TAFA), in particular we generalize the existing theory to the case of extended timed alternating finite automata (ETAFA). We define a framework extension of TAFA, study their power and properties. We develop an algebraic treatment of such ETAFA, along the lines of the algebraic treatment of systems of equations based o...

Deterministic finite H-Automata and ω-regular partial languages

Partial words, that is, finite words with holes, were introduced in the 70s by Fischer and Paterson, with respect to bioinformatics applications. Infinite partial words were introduced later. Recently, Dassow et al.’s connected partial words and regular languages. In this paper, we extend the local partial languages to local ω-partial languages and study their closure properties. We introduce t...

Inference of Event-Recording Automata Using Timed Decision Trees

In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership queries, each of which asks whether the language contains a certain word. There are many algorithms for learning DFAs, the most well-known being the L algorithm due to Dana Angluin. However, there are almost no extensions of...

Phase transition in firefly cellular automata on finite trees

We study a one-parameter family of discrete dynamical systems called the κ-color firefly cellular automata, proposed by the author in [13] as discrete models for finite-state pulse-coupled inhibitory oscillators. At each discrete time t , each vertex in a graph has a state (color) in {0, · · · ,κ−1}, and a special color b(κ) = bκ−1 2 c is designated as the ‘blinking’ color. During each transiti...